Verification of Java card programs
نویسنده
چکیده
syntax tree, 13annotated, 13addarray, 40, 41addarrays, 41addclass, 26, 55addobj, 26algebraic specifications, 23allsupers, 32antecedent, 63array accessproof rule, 78semantics, 35array assignmentproof rule, 79semantics, 37array creationproof rule, 81semantics, 40array initializerproof rule, 82semantics, 41ArrayAccess, 15ArrayAssign, 15asgcomp, 37, 52, 55, 128definition, 31assignment compatible, 37definition, 31 basic expression, 64, 65big-step semantics, 27binary operatorproof rule, 77semantics, 33BinaryExpr, 14blockproof rule, 88semantics, 47box, 63break statementproof rule, 90semantics, 51 castproof rule, 75semantics, 31catches statement, 16proof rule, 91semantics, 53class instance creationproof rule, 82semantics, 39ClassCastException, 31CompAssign, 15compatible, 135compound assignmentproof rule, 81semantics, 38conclusion, 70CondBinExpr, 14conditional binary operatorproof rule, 76semantics, 33conditional operatorproof rule, 76semantics, 33ConstrCall, 15ConstrDecl, 17constructor invocationproof rule, 83semantics, 41 decrement operatorproof rule, 80semantics, 37derivation, 70deterministic semantics, 61diamond, 63DL, 63do statementproof rule, 89semantics, 49done, 24dynamic logic, 63
منابع مشابه
Deductive Verification of C Programs with KeY-C
We present KeY-C: a tool for deductive verification of C programs. KeY-C allows verification of C programs w.r.t. operation contracts and invariants. It is based on an earlier version of KeY that supports Java Card. In this paper we outline syntax, semantics, and calculus of C Dynamic Logic (CDL) that were adapted from their Java Card counterparts. Currently, the tool is in an early development...
متن کاملA Formally Verified Calculus for Full Java Card
We present a calculus for the verification of sequential Java programs. It supports all Java language constructs and has additional support for Java Card. The calculus is formally proved correct with respect to a natural semantics. It is implemented in the KIV system and used for smart card applications.
متن کاملFormal Development of Safe and Secure Java Card Applets
This thesis is concerned with formal development of JAVA CARD applets. JAVA CARD is a technology that provides a means to program smart cards with (a subset of) the JAVA language. In recent years JAVA CARD technology gained great interest in the formal verification community. There are two reasons for this. Due to the sensitive nature (e.g., security, maintenance costs) of JAVA CARD applets, fo...
متن کاملSpecification and Runtime Verification of Java Card Programs
Java Card is a version of Java developed to run on devices with severe storage and processing restrictions. The applets that run on these devices are frequently intended for use in critical, highly distributed, mobile conditions. They are required to be portable and safe. Often, the requirements of the application impose the use of dynamic, on-card verifications, but most of the research develo...
متن کاملVerification of Safety Properties in the Presence of Transactions
The JAVA CARD transaction mechanism can ensure that a sequence of statements either is executed to completion or is not executed at all. Transactions make verification of JAVA CARD programs considerably more difficult, because they cannot be formalised in a logic based on preand postconditions. The KeY system includes an interactive theorem prover for JAVA CARD source code that models the full ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005